Structured Inversion of the Bernstein--Vandermonde Matrix
نویسندگان
چکیده
منابع مشابه
On the inversion of the Vandermonde matrix
The inversion of the Vandermonde matrix has received much attention for its role in the solution of some problems of numerical analysis and control theory. This work deals with the problem of getting an explicit formula for the generic element of the inverse. We derive two algorithms in O(n) and O(n) and compare them with the Parker–Traub and the Björck–Pereyra algorithms. 2005 Elsevier Inc. Al...
متن کاملThe Generalized Vandermonde Matrix
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملInversion of Vandermonde Matrices in FPGAs
In this thesis, we explore different algorithms for the inversion of Vandermonde matrices and the corresponding suitable architectures for implement in FPGA. The inversion of Vandermonde matrix is one of the three master projects of the topic, Implementation of a digital error correction algorithm for time-interleaved analog-to-digital converters. The project is divided into two major parts: al...
متن کاملThe structured sensitivity of Vandermonde-like systems
We consider a general class of structured matrices that includes (possibly confluent) Vandermonde and Vandermonde-like matrices. Here the entries in the matrix depend nonlinearly upon a vector of parameters. We define condition numbers that measure the componentwise sensitivity of the associated primal and dual solutions to small componentwise perturbations in the parameters and in the right-ha...
متن کاملFast inversion of Chebyshev { Vandermonde matrices 1
This paper contains two fast algorithms for inversion of ChebyshevvVander-monde matrices of the rst and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also more stable than other algorithms avail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2021
ISSN: 0895-4798,1095-7162
DOI: 10.1137/20m1336606